Moreau’s Decomposition Theorem Revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

gauss decomposition for chevalley groups, revisited

in the 1960's noboru iwahori and hideya matsumoto, eiichi abe and kazuo suzuki, and michael stein discovered that chevalley groups $g=g(phi,r)$ over a semilocal ring admit remarkable gauss decomposition $g=tuu^-u$, where $t=t(phi,r)$ is a split maximal torus, whereas $u=u(phi,r)$ and $u^-=u^-(phi,r)$ are unipotent radicals of two opposite borel subgroups $b=b(phi,r)$ and $b^-=b^-(phi,r)$ contai...

متن کامل

LSP Matrix Decomposition Revisited

In this paper, we study the problem of computing an LSP-decomposition of a matrix over a field. This decomposition is an extension to arbitrary matrices of the well-known LUP-decomposition of full rowrank matrices. We present three different ways of computing an LSPdecomposition, that are both rank-sensitive and based on matrix multiplication. In each case, for an m by n input matrix of unknown...

متن کامل

The Separatrix Theorem Revisited

We present a simple proof of Camacho-Sad’s Theorem on the existence of invariant analytic curves for singular holomorphic foliations in (C2, 0), avoiding the combinatorial arguments on the residues by means of a ramification.

متن کامل

Von Staudt’s theorem revisited

We establish a version of von Staudt’s theorem on mappings which preserve harmonic quadruples for projective lines over (not necessarily commutative) rings with “sufficiently many” units, in particular 2 has to be a unit. Mathematics Subject Classification (2010): 51A10 51C05 17C50

متن کامل

Fife's Theorem Revisited

We give another proof of a theorem of Fife — understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As an application we give a complete characterization of the overlap-free words that are 2-automatic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l'Institut Henri Poincaré C, Analyse non linéaire

سال: 1989

ISSN: 0294-1449

DOI: 10.1016/s0294-1449(17)30028-8